Non-Discrete P Systems

نویسندگان

  • Andrés Cordón-Franco
  • Fernando Sancho-Caparrini
چکیده

Until now, the usual variants of P systems have only a finite number of options in every step of their computations (that is, an associated computation tree is defined for them). In this way, irrespectively whether they are non-deterministic or probabilistic P systems, we obtain a discrete space of computations where the system evolves. Here we present a variant of P systems which in every step can evolve in a non-discrete number of choices. For that, we do not use discrete multisets, but multisets where the multiplicity of the objects can be real (positive) numbers. The inspiration of this paper is that, in vitro, we can control neither the application of the rules nor the exact number of objects, but we deal with an approximate and non natural number of applications (possibly, related with the concentration of the objects in the membrane). In this way, the multiplicity of an object does not reflect the exact number of identical copies of it in the membrane, but its concentration in the solution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Finite-time Control of Positive Linear Discrete-time Systems

This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...

متن کامل

Non-homogeneous continuous and discrete gradient systems‎: ‎the quasi-convex case

‎In this paper‎, ‎first we study the weak and strong convergence of solutions to the‎ ‎following first order nonhomogeneous gradient system‎ ‎$$begin{cases}-x'(t)=nablaphi(x(t))+f(t), text{a.e. on} (0,infty)\‎‎x(0)=x_0in Hend{cases}$$ to a critical point of $phi$‎, ‎where‎ ‎$phi$ is a $C^1$ quasi-convex function on a real Hilbert space‎ ‎$H$ with ${rm Argmin}phineqvarnothing$ and $fin L^1(0...

متن کامل

Robust Model Predictive Control for a Class of Discrete Nonlinear systems

This paper presents a robust model predictive control scheme for a class of discrete-time nonlinear systems subject to state and input constraints. Each subsystem is composed of a nominal LTI part and an additive uncertain non-linear time-varying function which satisfies a quadratic constraint. Using the dual-mode MPC stability theory, a sufficient condition is constructed for synthesizing the ...

متن کامل

Admissibility analysis for discrete-time singular systems with time-varying delays by adopting the state-space Takagi-Sugeno fuzzy model

This paper is pertained with the problem of admissibility analysis of uncertain discrete-time nonlinear singular systems by adopting the state-space Takagi-Sugeno fuzzy model with time-delays and norm-bounded parameter uncertainties. Lyapunov Krasovskii functionals are constructed to obtain delay-dependent stability condition in terms of linear matrix inequalities, which is dependent on the low...

متن کامل

The comparison of two high-order semi-discrete central schemes for solving hyperbolic conservation laws

This work presents two high-order, semi-discrete, central-upwind schemes for computing approximate solutions of 1D systems of conservation laws. We propose a central weighted essentially non-oscillatory (CWENO) reconstruction, also we apply a fourth-order reconstruction proposed by Peer et al., and afterwards, we combine these reconstructions with a semi-discrete central-upwind numerical flux ...

متن کامل

A class of multi-agent discrete hybrid non linearizable systems: Optimal controller design based on quasi-Newton algorithm for a class of sign-undefinite hessian cost functions

 In the present paper, a class of hybrid, nonlinear and non linearizable dynamic systems is considered. The noted dynamic system is generalized to a multi-agent configuration. The interaction of agents is presented based on graph theory and finally, an interaction tensor defines the multi-agent system in leader-follower consensus in order to design a desirable controller for the noted system. A...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007